A cutting-plane method for contiguity-constrained spatial aggregation

A cutting-plane method for contiguity-constrained spatial aggregation

Aggregating areas into larger regions is a common problem in spatial planning, geographic information science, and cartography. The aim can be to group administrative areal units into electoral districts or sales territories, in which case the problem is known as districting. In other cases, area aggregation is seen as a generalization or visualization task, which aims to reveal spatial pattern...

A Homogenized Cutting Plane Method

Analytic Center Cutting-Plane Method

An Improved Cutting Plane method for the solution of Probabilistic Constrained Problem with Discrete Random Variables

We consider a probabilistic constrained stochastic programming problem with discrete random variables. Two methods, a cutting plane and a column generation method have already been developed for the solution of the problem. In this paper we blend them together and obtain a method that is faster than the earlier ones. We also present a refined algorithm for the generation of p-level efficient po...

Towards a Practical Volumetric Cutting Plane Method for Convex Programming

We consider the volumetric cutting plane method for nding a point in a convex set C < n that is characterized by a separation oracle. We prove polynomiality of the algorithm with each added cut placed directly through the current point, and show that this \central cut" version of the method can be implemented using no more than 25n constraints at any time. with support from a CORE fellowship.